Non-Rigid Graph Registration Using Active Testing Search
نویسندگان
چکیده
منابع مشابه
Non-rigid Image Registration Using Graph-cuts
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a powerful combinatorial optimization tool which has been successfully applied into image segmentation and stereo matching. Under some specific constraints, graph-cuts method yields either a global minimum or a local min...
متن کاملNon-rigid Registration Using Morphons
The Morphon, a non-rigid registration method is presented and applied to a number of registration applications. The algorithm takes a protoype image (or volume) and morphs it into a target image using an iterative, multi-resolution technique. The deformation process is done in three steps: displacement estimation, deformation field accumulation and deformation. The framework could be described ...
متن کاملDiscrete Rigid Transformation Graph Search for 2D Image Registration
Rigid image registration is an essential image processing task, with a large body of applications. This problem is usually formulated in the continuous domain, often in the context of an optimization framework. This approach leads to sometimes unwanted artifacts, e.g. due to interpolation. In the case of purely discrete applications, e.g., for template-based segmentation or classification, it i...
متن کاملDiscrete rigid registration: A local graph-search approach
Image registrationhas becomea crucial step in awide range of imaging domains, fromcomputer vision to computer graphics. The core of image registration consists of determining the transformation that induces the best mapping between two images. This problem is ill-posed; it is also difficult to handle, due to the high size of the images and the high dimension of the transformation parameter spac...
متن کاملLandmark-Based Non-rigid Registration Via Graph Cuts
This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contribution of our method is the formulation of landmarks in the graph cut minimization framework. In the graph cut method, we add a penalty cost based on landmarks to the data energy. In the presence of a landmark, we adjust the T-link...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2015
ISSN: 0162-8828,2160-9292
DOI: 10.1109/tpami.2014.2343235